Method and system for transmission and frequency domain equalization for wideband CDMA system

ABSTRACT

The invention provides a method and system for transmission and frequency domain equalization for wideband CDMA communications by providing at least one spread sequence portion, and inserting a cyclic redundancy to the spread sequence to form a transmitted baseband sequence. The invention further provides a method and system for converting a plurality of receive samples from at least one spread sequence portion into a plurality of frequency domain samples, determining a plurality of frequency domain equalization weights for the frequency domain samples, and determining a time domain signal estimate based on the frequency domain equalization weights and frequency domain samples.

RELATED APPLICATION

[0001] This application claims the benefit of U.S. Provisional Application No. 60/259,043, filed Dec. 29, 2000.

FIELD OF THE INVENTION

[0002] The present invention generally relates to the field of communication systems. More specifically, the invention relates to a transmission format and related equalization methods for CDMA and direct-sequence spread spectrum communication systems.

BACKGROUND OF THE INVENTION

[0003] Code-Division Multiple Access (CDMA) is a well-known spread-spectrum physical layer technology for cellular systems. CDMA is currently used in the US IS-95 cellular standard and forms the foundation for some so-called 3^(rd) generation cellular systems, such as IS-2000. Third generation (3G) systems are designed to support higher data rates and a wide range of new services. However, the demand for even higher data rates is expected to lead to the development of 4^(th) generation systems in the years following the deployment of 3G.

[0004] There are several known techniques for increasing the peak per-user data rate in a CDMA system. First, the concept of multi-code CDMA involves simultaneously allocating multiple Walsh-code channels to a single user, thereby multiplying the peak data rate that can be delivered to any one user at a time. Second, increasing the chip rate, and therefore the system bandwidth, will directly increase the peak per-user data rate. Third, the use of higher-order modulation on each of the Walsh-code channels provides another method for increasing the data-carrying capacity.

[0005] Current cellular CDMA systems operate in relatively low bandwidths (1.25 MHz), and use low-order modulation with aggressive error control coding. On the forward link of these systems, the performance with a RAKE receiver is generally viewed as adequate for typical land-mobile cellular channels. However, if the previously mentioned techniques are used to significantly increase the data rate, the RAKE receiver can be shown to provide sub-optimal performance in severe multipath channels. Much of the reason for this sub-optimal performance can be traced to the fact that a multipath delay spread channel destroys the orthogonality of the Walsh-code channels. Walsh codes are orthogonal to each other, but have nonzero autocorrelation and nonzero cross-correlation properties. This loss of Walsh code orthogonality causes the output of a particular RAKE finger to contain significant energy (i.e., interference) from the multipath components having different arrival times. This interference, from other multipath components, is called intracellular interference. Intracellular interference becomes more severe as the channel multipath delay spread increases. As the system bandwidth is increased, the chip-span of a given multipath delay spread channel increases proportionally, which increases the required number of RAKE fingers in the RAKE receiver. As the number of multipath components resolved in the receiver increases, intracellular interference increases, which can further degrade RAKE performance.

[0006] As an alternative to a RAKE receiver, time-domain adaptive equalization is a technique for suppressing forward link intracellular interference caused by loss of Walsh code orthogonality. In contrast to a RAKE receiver, a time-domain MMSE adaptive equalizer balances the need to restore Walsh channel orthogonality with noise enhancement, thereby reducing the intracellular interference on the CDMA forward link. However, as system bandwidth increases, time-domain techniques known in the art for MMSE adaptive equalization have a complexity that grows rapidly with the channel length. A larger signal bandwidth typically results in a longer channel length, as measured in chip-times. As higher and higher system bandwidths are employed in future CDMA systems, equalization strategies having complexities lower than the time-domain techniques for MMSE adaptive equalization will be needed.

[0007] Therefore, it would be desirable to have a method and device for providing improved transmission format and equalization strategies to enable CDMA systems to support much higher data rates in future broadband wireless systems. Further, it would be desirable that the improved equalization strategies provide for the complexities and problems mentioned.

BRIEF DESCRIPTION OF THE DRAWINGS

[0008]FIG. 1 is an overview diagram of one embodiment of a wireless (cellular) communication system in accordance with the invention;

[0009]FIG. 2 is a block diagram illustrating one embodiment of a transmitting device embedded within the communication system of FIG. 1 in accordance with the invention;

[0010]FIG. 3 is a block diagram of one embodiment of a receiving device embedded within the communication system of FIG. 1 in accordance with the invention;

[0011]FIG. 4 is a block diagram of one embodiment of a receiving device that has a plurality of receiver branches, embedded within the communication system of FIG. 1 in accordance with the invention;

[0012]FIG. 5 is a timing diagram of one embodiment for transmitting data blocks;

[0013]FIG. 6 is a timing diagram illustrating alternative embodiments for deploying cyclic redundancies comprised of known chips (KC) in a frame containing three CDMA symbol blocks;

[0014]FIG. 7 is a timing diagram of one embodiment for inserting a block of pilot chips into the transmitted CDMA waveform;

[0015]FIG. 8 is a flow diagram for one embodiment of a transmitter generating and transmitting a data sequence in accordance with the present invention;

[0016]FIG. 9 is a flow diagram of one embodiment of a receiver detecting transmitted data symbols in accordance with the present invention; and

[0017]FIG. 10 is a flow diagram for an additional embodiment of a transmitter in accordance with the invention.

DETAILED DESCRIPTION OF THE PRESENTLY PREFERRED EMBODIMENTS

[0018] The following detailed description presents a general formulation for the characteristics of a preferred embodiment of the invention. Based on the detailed description of the invention, a new method can be used to design new direct-sequence spread spectrum and CDMA air interfaces.

[0019]FIG. 1 illustrates a wireless communication system 100 in accordance with one embodiment of the present invention. As shown in FIG. 1, a base station 110 provides communication service to a geographic region known as a cell 103, 102. At least one user device 120 and 130 communicates with the base station 110. More generally, the term communication device can be used to refer to a user device 120, a base station 110, other types of communication transmitters or receivers, or portions or combinations of such items. In one embodiment of the wireless communication system 100, at least zero external interference sources 140 share the same spectrum allocated to the base station 110 and user devices 120 and 130. The external interference sources 140 represent an unwanted source of emissions that interferes with the communication process between the base station 110 and the user devices 120 and 130. The exact nature and number of the external interference sources 140 will depend on the specific embodiment of the wireless communication system 100. In the embodiment shown in FIG. 1, an external interference source can be another user device 140 (similar in construction and purpose to user device 120) and/or basestation 112 that is communicating with another base station 112 or user device 140, respectively, in the same frequency spectrum allocated to base station 110 and user devices 120 and 130. As shown in FIG. 1, user devices 120 have a single transmit antenna 101, while user devices 130 have at least one antenna 101. One embodiment of the invention provides that the user devices 120 and 130, as well as the base station 110 may transmit, receive, or both from the at least one antenna 101. An example of this would be a typical cellular telephone. Additionally, one embodiment of the invention can be implemented as part of a base station 110 as well as part of a user device 120 or 130. Furthermore, one embodiment provides that user devices as well as base stations may be referred to as transmitting units, receiving units, transmitters, receivers, transceivers, or any like term known in the art, and alternative transmitters and receivers known in the art may be used.

[0020]FIG. 2 illustrates one embodiment for a process of generating a transmitted waveform in accordance with an embodiment of the invention. The forward link may use U Walsh codes 210 of length N to form U≦N Walsh code channels between the base station and its user population. On an active Walsh code channel, a data symbol (e.g., QAM or PSK) 205 is modulated 225 by the particular Walsh code 210, and the set of active Walsh code channels may be power controlled 215, summed 220, and spread 225 by a long code 230. When two or more code channels are active, the sum of the active code channels (before or after long code spreading) is also called a multicode sequence or a multicode spread sequence. In one embodiment, after long code spreading, the samples out of the spreader (spread sequence) 225 are converted from serial to parallel 235 creating a baseband chip-level sequence. The baseband chip-level sequence can alternatively be formed by collecting NK consecutive samples out of the spreader into a single block. In an additional embodiment, the converted spread sequence 235 may be comprised of a spread sequence portion where the spread sequence portion may contain at least; a fraction or more of the spread sequence, a plurality of concatenated spread sequences, or a baseband chip-level sequence. Further, in one embodiment, a prefix of provided L_(p) samples are added (inserted) to the parallel outputs 235, and the resulting output 240 are converted from parallel to serial 245. The serial samples at the output 245 may then be pulse shaped 250 before being transmitted. In one embodiment, the long code 230 can be a psuedo-random code that may have the same chip spacing as the Walsh codes 210, such that the long code acts simply as a scrambling code. Additionally in one embodiment, a block containing K successive Walsh-code intervals (also called data symbol intervals) can be transmitted in a time slot on each of the U active Walsh channels. In an additional embodiment, channelization codes other than Walsh codes can be used in place of the Walsh codes 210.

[0021] The process for generating the transmitted waveform in accordance with an embodiment of the invention is illustrated mathematically in the following formula for the baseband chip-level sequence to be transmitted in the b^(th) data block by the base station on the forward link: $\begin{matrix} {{{s\left\lbrack {i,b} \right\rbrack} = {\sum\limits_{u = 1}^{U}{A_{u}{\sum\limits_{k = 0}^{K - 1}{{d_{u}\left\lbrack {k,b} \right\rbrack}{c\left\lbrack {i,b} \right\rbrack}{W_{u}\left\lbrack {i - {Nk}} \right\rbrack}}}}}},{0 \leq i \leq {{NK} - 1}}} & (1) \end{matrix}$

[0022] In this embodiment of the formula (denoted as equation 1, equation (1), or (1)), s[i, b] is the baseband chip-level sequence to be transmitted by the base station during the b^(th) data block. d_(u)[k, b] is the k^(th) data symbol (e.g., QAM or PSK) on Walsh code channel u for the b^(th) data block. In addition, the value of the long code sequence on chip i of data block b for the base station in question is c[i, b]. W_(u)[i], 0≦i≦N−1, is the length N Walsh sequence for the u^(th) Walsh channel (1≦u ≦N), where it is understood that W_(u)[i] is nonzero only when 0≦i≦N−1. Additionally for this embodiment, U denotes the number of active Walsh channels, where 0≦U≦N. When two or more Walsh channels are active, s[i, b] can be called a multicode chip-level sequence or a multicode signal. The factor A_(u) denotes the power control gain factor for the u^(th) Walsh code channel. The total number of chips in the b^(th) block of the baseband chip-level sequence s[i, b] is equal to NK. The chip level sequence may be described as a baseband sequence at a center frequency of zero for convenience, and in another embodiment the invention can be used when part or all of the processing is carried out at a non-zero center frequency.

[0023] In one embodiment of the invention, “cyclic redundancy” of L_(p) chips may be inserted into the baseband chip-level sequence s[i, b] before the sequence is filtered by a pulse shaping filter at the transmitter, as in block 240 of FIG. 2. For one embodiment of the invention, cyclic redundancy can be one of the following:

[0024] 1. A cyclic prefix, which is a repetition of the last L_(p) chips of a baseband chip-level sequence, inserted at the beginning of the chip-level sequence;

[0025] 2. A cyclic postfix, which is a repetition of the first L_(p) chips of a baseband chip-level sequence, inserted at the end of the chip-level sequence;

[0026] 3. A combination of a postfix of length L_(p1) and a prefix of length L_(p2). In one embodiment of this method, L_(p1) and L_(p2) can be chosen to satisfy (L_(p1)+L_(p2))=L_(p).

[0027] 4. A null cyclic postfix, null cyclic prefix, or a combination of a null cyclic prefix and postfix. A null cyclic prefix is a prefix consisting of chips that are all zero in amplitude. If the cyclic redundancy is composed of zero chips, then the long code can be applied to the entire baseband chip-level sequence, including the cyclic redundancy.

[0028] 5. L_(p) known chips repeated before and after the baseband chip-level sequence. For another embodiment of the invention, the known chips can be pilot or other predetermined chips recognized by the receiver; or

[0029] 6. A block of known chips, which is inserted either before or after each of a plurality of baseband chip-level sequences. For one embodiment, the block of known chips can be inserted before the first baseband chip-level sequence s[i, 1], and before the second baseband chip-level sequence s[i, 2], and so forth. This method inserts the same block of known chips at a plurality of locations in the transmitted signal. The long code has no effect on the values of the known chips that are transmitted since the long code is not applied to these known chips.

[0030] For items 5 and 6 above, known chips can also be described as known symbols if the known chips are considered to be known symbols transmitted within the cyclic redundancy. The known chips or symbols can have arbitrary values, or they can be taken from a commonly known constellation such as M-PSK or M-QAM.

[0031] The term “cyclic redundancy”, as used herein is not related to a cyclic redundancy check (CRC). CRC is a well-known method in the art for enabling a receiver to detect the presence of bit errors in a decoded bit stream. As such, a CRC, if used in a CDMA or spread spectrum system, operates on information bits in the transmitter (prior to symbol mapping and spreading) and detected bits in the receiver (after despreading and symbol detection), using error detection algorithms based on binary arithmetic. The cyclic redundancy of the present invention can be used regardless of the presence or absence of any CRC schemes in the system.

[0032] In the following description, whenever the invention is described for the case where the cyclic redundancy is a cyclic prefix, the description can easily be extended to the case where other forms of cyclic redundancy are employed.

[0033] The value of L_(p) is not required to be an integer multiple of N because the L_(p) samples can be discarded in the receiver of one embodiment. Additionally, the value of L_(p) is preferably selected to be greater than or equal to the length of the multipath channel as measured in chip times, where the channel length can comprise the delay spread plus any significant “tails” of the pulse shaping waveform.

[0034] In one embodiment of the invention, a cyclic redundancy comprising a cyclic postfix can be added (inserted) at the end of the b^(th) symbol block to be transmitted. The expression for the transmitted baseband chip sequence for this embodiment can be represented as: $\begin{matrix} {{x\left\lbrack {i,b} \right\rbrack} = \left\{ \begin{matrix} {{s\left\lbrack {i,b} \right\rbrack},} & {0 \leq i \leq {{NK} - 1}} \\ {{s\left\lbrack {{i - {NK}},b} \right\rbrack},} & {{NK} \leq i \leq {{NK} + L_{p} - 1}} \end{matrix} \right.} & (2) \end{matrix}$

[0035] In another embodiment, a cyclic redundancy comprising a cyclic prefix can be added (inserted) at the beginning of the symbol block to be transmitted. The expression for the transmitted baseband chip sequence for this embodiment can be represented as: $\begin{matrix} {{x\left\lbrack {i,b} \right\rbrack} = \left\{ \begin{matrix} {{s\left\lbrack {{i + {NK} - L_{p}},b} \right\rbrack},} & {0 \leq i \leq {L_{p} - 1}} \\ {{s\left\lbrack {{i - L_{p}},b} \right\rbrack},} & {L_{p} \leq i \leq {{NK} + L_{p} - 1}} \end{matrix} \right.} & (3) \end{matrix}$

[0036] Additionally, in an embodiment of the invention, the cyclic redundancy is split between a cyclic prefix and a cyclic postfix.

[0037] After the sequences x[i, b], (0≦i≦NK+L_(p)−1, 0≦b≦B−1) for each of the B data blocks are formed using equation (3), the sequences may be concatenated to form the transmitted baseband sequence vector x according to another embodiment of the invention:

x=[x[ 0, 0] x[ 1, 0] . . . x[NK+L _(p)−1, B−1]]^(T)  (4)

[0038] The transmitted baseband sequence may then be pulse shaped to form the transmitted waveform: $\begin{matrix} {{x(t)} = {\sum\limits_{i = 0}^{N_{c} - 1}{x_{i}{p_{sr}\left( {t - {iT}_{c}} \right)}}}} & (5) \end{matrix}$

[0039] where x_(i) is the i^(th) element of the vector x, and p_(sr)(t) is the pulse shaping waveform which typically has the square-root raised cosine spectrum, as is known in the art. Also, N_(c)=B(NK+L_(p)) is defined in one embodiment, to be the total number of chips to be transmitted in the B symbol blocks. Equation (5) is the “chip-level waveform” for one embodiment of a forward link transmission format of the invention. Although equation (4) represents a group of B data blocks as a single vector, this is done for mathematical convenience, and for an embodiment of the invention, it is not necessary to generate or store all B data blocks before beginning to pulse shape and transmit the first data block.

[0040] Equation (5) is the convolution of a discrete-time complex chip sequence x_(i) and a pulse-shaping waveform p_(sr)(t). The form of equation (5) may be similar to a single-carrier waveform having complex data symbols x_(i). In a single carrier system, however, x_(i) would be limited to a finite number of complex values corresponding to the constellation points of a well-known modulation format (e.g., BPSK, QPSK, 16-QAM, etc.). In the CDMA system, x_(i) is not chosen from a predefined set of complex constellation points; rather, x_(i) may be formed from the superposition of a number of Walsh-code modulated data symbols with prefixes inserted according to equations (2) and (3), for example.

[0041] The transmitted signal propagates through a multipath channel of one embodiment, with an RF impulse response given by: $\begin{matrix} {{h_{RF}(t)} = {\sum\limits_{l = 0}^{L - 1}{h_{l}{\delta \left( {t - \tau_{l}} \right)}}}} & (6) \end{matrix}$

[0042] where h_(l) and τ_(l) are the complex gain and time delay of the l^(th) path, respectively and δ(t) is the Dirac delta function as known in the art. For this embodiment, the channel impulse response is assumed time-invariant during the transmitted block of K data symbols; alternatively, the extension of Equation (6) to time-varying channels is straightforward to anyone skilled in the art. At the receiver of one embodiment, the received signal is fed into a filter preferably having an impulse response p_(sr)(−t). The resulting matched-filtered waveform may be illustrated mathematically as: $\begin{matrix} {{y(t)} = {\sum\limits_{i = 0}^{N_{c} - 1}{x_{i}{h\left( {t - {iT}_{c}} \right)}}}} & (7) \end{matrix}$

[0043] where h(t) is the overall impulse response between the transmitted baseband complex sequence x_(i) and the received matched-filtered waveform y(t). h(t) generally includes the transmit pulse shaping, the received matched filtering, and the impulse response of the RF channel, and may be illustrated as: $\begin{matrix} {{h(t)} = {\sum\limits_{i = 0}^{L - 1}{h_{l}{p_{rc}\left( {t - \tau_{l}} \right)}}}} & (8) \end{matrix}$

[0044] where p_(rc)(t) is the convolution of p_(sr)(t) with p_(sr)(−t), (p_(rc)(t) typically has the raised-cosine spectrum). After matched-filtering, the received waveform can be sampled at the chip rate to form the received sequence y[m]: $\begin{matrix} {{y\lbrack m\rbrack} = {{y\left( {mT}_{c} \right)} = {{\sum\limits_{i = 0}^{N_{c} - 1}{x_{i}{h\left( {{mT}_{c} - {iT}_{c}} \right)}}} = {\sum\limits_{i = 0}^{N_{c} - 1}{x_{i}{h\left\lbrack {m - i} \right\rbrack}}}}}} & (9) \end{matrix}$

[0045] where the definition h[m]=h(mT_(c)) is used. For clarity of presentation, Equation (9), as written, does not include the noise in the received signal. Extending the analysis to over-sampled receivers and including the effect of noise are straightforward to anyone skilled in the art. The received signal can also be sampled at a rate exceeding the chip rate and satisfying the Nyquist rate, and in one embodiment, the matched filter can be implemented digitally. When the matched filter is implemented digitally, the output can be decimated to the chip rate. If the sampling rate after the matched filter is the chip rate, the performance of the receiver may be improved for some channels by selecting a particular sampling phase, which may be determined using a chip timing estimation method.

[0046] If the RF channel impulse response contains path delays τ_(l) that are multiples of the chip times T_(c), then h(mT_(c)−iT_(c))=h[m−i]=h_(m−i), provided the pulse waveform p_(sr)(t) follows the zero intersymbol interference property as described in the J. G. Proakis publication “Digital Communications”. With a chip-spaced channel of length L chips, Equation (9) then becomes: $\begin{matrix} {{y\lbrack m\rbrack} = {{\sum\limits_{i = 0}^{N_{c} - 1}{x_{i}h_{m - i}}} = {{\sum\limits_{l = 0}^{L - 1}{h_{l}x_{m - i}\quad {for}\quad 0}} \leq m \leq {N_{c} + L - 2}}}} & (10) \end{matrix}$

[0047] An equation similar to (10) can also be used for arbitrary sampling points in the receiver. For this embodiment, h_(m−i) can be replaced with h((m−i−γ)T_(c)) from (8), which depends the impulse response of the channel, the pulse waveform, and a received signal relative sampling phase a, where 0≦γ<T_(c).

[0048] At the receiver of one embodiment, the cyclic redundancy samples (which are the first L_(p) received samples for the case of a cyclic prefix) for each symbol block are discarded, and the remaining NK chips of each block may be transformed into the frequency domain with a length NK Fast Fourier Transform (FFT) or Discrete Fourier Transform (DFT). An embodiment provides that r[m, b] denote the received chip-spaced samples corresponding to the b^(th) symbol block after the prefix samples for the block have been discarded. Starting with Equation (9) and removing the cyclic redundancy, r[m, b] can be written as: $\begin{matrix} {{r\left\lbrack {m,b} \right\rbrack} = {\sum\limits_{i = 0}^{L_{p} - 1}{{h\lbrack i\rbrack}{s\left\lbrack {{m - i},b} \right\rbrack}}}} & (11) \end{matrix}$

[0049] where in one embodiment of the invention, the following assumptions are made: First the raised cosine waveform P_(rc)(t) may be assumed to be time limited for the interval −N_(p)T_(c)≦t≦N_(p)T_(c), where N_(p) is the number of significant “tails” of the raised cosine waveform. Second, in the RF channel response as defined in equation (6), the first multipath arrival time is N_(p)T_(c) and the maximum multipath arrival time τ_(L) can be assumed no greater than (L_(p)−2N_(p))T_(c), where L_(p) is the length of the prefix. One embodiment of the invention is also applicable to cases where τ_(L)>(L_(p)−2N_(p))T_(c), but performance may be better when τ_(L)≦(L_(p)−2N_(p))T_(c)). These assumptions imply that h[i]=h(iT_(c)) is nonzero only for 0≦i≦L_(p)−1. For the b^(th) symbol block, the length NK DFT of the sequence r[m, b] is defined to be: $\begin{matrix} {{R\left\lbrack {k,b} \right\rbrack} = {\sum\limits_{m = 0}^{{NK} - 1}{{r\left\lbrack {m,b} \right\rbrack}^{{- {j2\pi}}\quad {{mk}/{NK}}}}}} & (12) \end{matrix}$

[0050] Using equation (11), and assuming an embodiment where cyclic prefixes are placed at the beginning of a symbol block, then one embodiment of equation (12) can be shown to be:

R[k, b]=H[k]S[k, b]  (13)

[0051] where $\begin{matrix} {{{S\left\lbrack {k,b} \right\rbrack} = {\sum\limits_{m = 0}^{{NK} - 1}{{s\left\lbrack {m,b} \right\rbrack}^{{- {j2\pi}}\quad {{mk}/{NK}}}}}}{and}} & (14) \\ {{H\lbrack k\rbrack} = {\sum\limits_{m = 0}^{L_{p} - 1}{{h\lbrack m\rbrack}^{{- {j2\pi}}\quad {{mk}/{NK}}}}}} & (15) \end{matrix}$

[0052] Equations (12) through (15) can easily be extended by those skilled in the art to the cases where other forms of cyclic redundancy are used.

[0053] A frequency domain equalizer/diversity combiner operates on the frequency domain sequences R_(i)[k, b], where the subscript i indicates the i^(th) receive antenna, and i=1, 2, . . . M. This embodiment assumes the receiver has an arbitrary number (M) of receive antennas. The purpose of the combiner is to form a frequency domain signal Z[k, b] by weighting and summing the R_(i)[k, b]. If the vector R[k, b] is defined to be [R₁[k, b] R₂[k, b] . . . R_(M)[k, b]]^(T)then Z[k, b] is formed as follows:

Z[k, b]=w ^(H) [k, b]R[k, b]  (16)

[0054] where w[k, b] is a length M vector of combining weights (also known as equalizer gain values) for the k^(th) sub-carrier of the b^(th) data block. The superscript H is the complex conjugate transpose operator. This frequency domain signal can be transformed back into the time domain using an Inverse Fast Fourier Transform (IFFT) or Inverse Discrete Fourier Transform (IDFT), where the long-code is stripped off and Walsh despreading is carried out to recover the transmitted data symbols for each Walsh-code channel. This embodiment is illustrated for a single antenna receiver in the block diagram shown in FIG. 3, and is illustrated for multiple receivers or receive antenna (branches) in FIG. 4.

[0055] For one embodiment of the invention, and as shown in FIG. 3, the received signal 305 may be filtered with a chip matched filter 310, and NK+L_(p) samples may then be converted from serial to parallel 315. The cyclic redundancy of L_(p) samples can be removed 320, and the result fed into a DFT 325. The equalizer gain values are applied 330 to the outputs of the DFT 325, and the result converted into the time domain with an IDFT 335. The parallel outputs of the IDFT 335 may then be converted to serial form 340. The serial outputs 340 can be fed to a despreader 345, which can compute the despread data 350.

[0056] An embodiment illustrated in FIG. 4 filters the received signals from the M receiver branches 405 with a chip-matched filter 310. The outputs of the chip matched filters 310 are each converted from serial to parallel 315. The cyclic redundancy is removed 320 and the resulting samples are converted to the frequency domain with a DFT 325. After the DFT 325 in each branch, the equalizer gain values may be applied 330. The weighted outputs of the applied equalizer gain values 330 are summed by at least one summation device 410, and for one embodiment, the outputs of the at least one summation device are fed into an IDFT 335. The outputs of the IDFT 335 may then be converted from parallel to serial 340, and fed to a despreader 345 which can compute the despread data 350.

[0057] For one embodiment of the invention, there may be several criteria for computing the frequency domain weight vector for use in Equation (16). One criterion may compute the weight vector to minimize the mean square error between the frequency domain transmitted signal and the frequency domain received signal. If the noise and interference are assumed to be spatially white, then the M×1 weight vector w[k, b] that satisfies this Minimum Mean Square Error (MMSE) criteria can be shown to be: $\begin{matrix} {{w\left\lbrack {k,b} \right\rbrack} = \frac{H\left\lbrack {k,b} \right\rbrack}{{{H^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}} + {\sigma^{2}(k)}}} & (17) \end{matrix}$

[0058] where the M×1 vector H[k, b] is defined to be [H₁[k, b] H₂[k, b] . . . H_(M)[k, b]]^(T), where H_(i)[k, b] is the frequency domain channel gain (see equation (15)) at the i^(th) receive antenna, the k^(th) frequency bin and the b^(th) time block. In the embodiment of equation (17), σ²(k) can be referred to as the noise power on the k^(th) frequency bin. In another embodiment, σ²(k) can be the combined power of the spatially white noise plus the other-cell interference on the k^(th) frequency bin. Additionally, an alternate embodiment provides that σ²(k) can be the power of the thermal noise on the k^(th) frequency bin. Equation (17) handles both the single receive antenna equalization case as well as the joint equalization/diversity combining case with multiple receive antennas. If an embodiment of the receiver knows the channel response to J−1 interferers, then equation (17) can be modified as: $\begin{matrix} {{w\left\lbrack {k,b} \right\rbrack} = {\left( {{\sum\limits_{j = 1}^{J}{{H_{j}\left\lbrack {k,b} \right\rbrack}{H_{j}^{H}\left\lbrack {k,b} \right\rbrack}}} + {\sigma^{2}I}} \right)^{- 1}{H_{1}\left\lbrack {k,b} \right\rbrack}}} & (18) \end{matrix}$

[0059] where H_(j)[k, b] is the M×1 vector of channel gains between the j^(th) incident signal and the M receive antennas at frequency bin k, data block b. In the embodiment of equation (18), j=1 refers to the desired signal, and σ² represents the noise power of the receive elements after despreading. If the spatial covariance matrix of any interference aside from the aforementioned J−1 interferers is known, then the value of that known spatial covariance matrix on frequency bin k should be added to the quantity inside the parenthesis of equation (18).

[0060] Another embodiment of the invention may compute the weight vector by using the zero-forcing criteria. In this case, the M×1 weight vector w[k, b] can be shown to be:

w[k, b]={Θ[k, b](Θ^(H) [k, b]Θ[k, b])^(−1}) ₁  (19)

[0061] where { }_(i) denotes the i^(th) column of the matrix inside the brackets, and Θ[k, b] is an M×J matrix defined as:

Θ[k, b]=[H ₁ [k, b] H ₂ [k, b] . . . H _(J) [k, b]]  (20)

[0062] The embodiments of equations (18) and (19) can provide the receiver the ability to explicitly suppress the interference from the J−1 interference sources in the spatial domain. This spatial interference suppression can be achieved in addition to any suppression due to CDMA despreading. The embodiment of equation (17) provides relatively little spatial suppression compared with (18) and (19) due to the spatially white interference assumption in (17). in addition, zero-forcing weights can place an explicit spatial null in the spatial directions of the J−1 interference signals, without regards to the potential for noise enhancement. The MMSE weights of equation (18) attempt to balance the problem of noise enhancement with interference suppression. Additionally, equation (18) requires an inverse of size M for each frequency bin of each data block, whereas equation (19) requires an inverse of size J. Furthermore, one embodiment provides that the channel responses used in the previously described equations are generally estimated during a training interval containing a known pilot chip sequence. If the transmitted signal power during the training interval differs from the transmitted power when the data symbols are transmitted, then the channel response used in the equalizer/diversity weights can be modified to account for the actual transmit power being used at the time the weights are applied, producing appropriately scaled frequency domain equalization weights. If the transmit power during the data portion is equal to a power weight α times the power transmitted during the training interval, then equation (17) may be modified to be: $\begin{matrix} {{w\left\lbrack {k,b} \right\rbrack} = \frac{\sqrt{\alpha}{H\left\lbrack {k,b} \right\rbrack}}{{\alpha \quad {H^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}} + {\sigma^{2}(k)}}} & (21) \end{matrix}$

[0063] An appropriate alternative embodiment is: $\begin{matrix} {{w\left\lbrack {k,b} \right\rbrack} = \frac{H\left\lbrack {k,b} \right\rbrack}{{{H^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}} + \frac{\sigma^{2}(k)}{\alpha}}} & (22) \end{matrix}$

[0064] Similar modifications to equations (18) and (20) can be made for this embodiment.

[0065] The power weight is important for maintaining the correct relative power level between the noise power and the signal power on the data blocks. If the incorrect relative power between the data signal and the noise is used then there may be sub-optimal performance out of the MMSE combiner (e.g., increased bit error rate).

[0066] Once the frequency domain combined signal Z[k, b] is computed according to equation (16), an IFFT can be performed to compute the time-domain equivalent waveform z(t,b). To preserve the magnitude of the transmitted waveform, the following scale factor can be applied: $\begin{matrix} {\beta = \frac{1}{\frac{1}{NK}{\sum\limits_{k = 0}^{{NK} - 1}{{w^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}}}}} & (23) \end{matrix}$

[0067] It can be important to have the correct magnitude scaling of the estimated symbols especially for higher order modulations such as 16-QAM. An increased number of bit errors can occur because the symbol decisions may be mapped to the wrong symbol value because the amplitude scaling was incorrect. The use of the above β can prevent this problem.

[0068] Long-code removal and Walsh despreading may then be carried out. At this point, another scale factor can be applied to each Walsh Channel to match the gain of the despread symbols to the QAM constellation being used in the decision device. If the constellation is constant modulus, then scaling is not necessary.

[0069] Alternative embodiments of the invention may use alternative options for incorporating the cyclic redundancy into the CDMA forward link. FIG. 5 illustrates one embodiment of a cyclic prefix design where an integer number K of CDMA symbols can be grouped together with a cyclic prefix to form a data block. FIG. 5 contains a timing diagram 500 that illustrates an option for transmitting data blocks according to equation (1). In this embodiment, a data block 510 consists of KCDMA symbol intervals, each containing N chips. Each data block 510 may then consist of NK chips 530 plus a cyclic prefix 520 of L_(p) chips. In this embodiment, the L_(p) chips are a repetition of the last L_(p) chips in the chip-level CDMA waveform.

[0070] Given the nature of the equalization strategy described for FIG. 5, there is no need to require that an integer number of CDMA Walsh-code intervals be contained in one data block. As long as both transmitter and receiver embodiments agree in advance as to the parameters of the data block, then arbitrary block-lengths can be employed. A convenient number of CDMA chips can be chosen to belong to a data block, as long as the appropriate length L_(p) prefix is inserted at the proper time point. The receiver can then divide the received chip-level sequence into the appropriate data blocks, perform the FFT to transition into the frequency domain, carry out the frequency domain equalization/diversity combining, and IFFT the result back into the time-domain. The time-domain equalized chip sequences from successive data blocks may then be “pieced” together and fed to the long-code removal Walsh despreading functions. Because equalization is carried out before long-code removal and Walsh despreading, how the transmitted chip sequence is blocked off and combined with cyclic redundancy can be chosen to be independent of the Walsh-code length or other system parameters. However, in a mobile environment, the length of a data block may affect performance in highly variable channels because the equalization process performs better if the channel does not change across a data block.

[0071] When an embodiment employs known chips (KC) as the cyclic redundancy rather than a cyclic prefix, the expressions for the transmitted baseband chip sequence need to be modified. Examples of known chips include, for example, zero valued chips, which are also known as null cyclic prefixes.

[0072] In order to create the appearance of a circular channel, each symbol block to be transmitted may have the same set of known chips at both the beginning and at the end of the symbol block. At the receiver, the FFT can then be carried out over the baseband chip-level sequence plus the L_(p) known chips at the end of the symbol block. This situation is shown in the embodiment A of FIG. 6, where each block consists of 2L_(p) 645+NK 655 chips, and where K is the number of CDMA symbol intervals within a symbol block, N is the Walsh code length, and L_(p) 645 is the prefix length. In this embodiment, the FFT size, N_(F) 675, can be equal to NK 655+L_(p) 645, which is different than it would be with cyclic prefixes. FIG. 6 shows two schemes for deploying known chips in a frame containing three CDMA symbol blocks. A more efficient way of deploying known chips than in embodiment A is shown in the embodiment B. In embodiment B, adjacent symbol blocks 620 share the known chips 635 and fewer chip intervals are needed to transmit the same information compared with embodiment A. As with embodiment A, embodiment B can also use an FFT size, N_(F) 677, equal to NK 665+L_(p) 647.

[0073] For the embodiment of A, each data block 610 has two identical sets of known chips 615, one at the beginning and one at the end. In the embodiment B, one leading set of known chips 635 at the beginning of the frame, and adjacent blocks 620 share the same set of known chips 635.

[0074] The previous embodiments may assume the receiver has determined the frequency domain channel response between the transmitter and the receiver. In the equations covering explicit spatial interference suppression (18), (19) the receiver can be assumed to have determined the frequency domain channel responses between J−1 interfering sources and the receive antenna (or antenna array when more than one receive antenna is being used).

[0075] Embodiments of the invention may use a number of viable techniques for estimating the channel responses. For many of these methods, a block of pilot chips or other known signals can be periodically inserted into the transmitted waveform. FIG. 7 shows an embodiment for inserting a block of pilot chips into a transmitted CDMA waveform. As shown in the FIG. 7, the block of pilot chips 710 is periodically inserted between data blocks 720. Any chip sequence suitable for channel estimation in accordance with the invention, can be used in the pilot block.

[0076] The pilot sequence can be any waveform that is suitable for measuring the channel frequency response. Examples of possible pilot chip signal formats include:

[0077] 1) A multi-code CDMA signal that is similar to the multicode data signal, but uses known symbols to modulate the Walsh code channels;

[0078] 2) A BPSK or QPSK signal modulated with a known symbol at each chip time;

[0079] 3) An un-modulated long-code sequence; and

[0080] 4) An orthogonal frequency division multiplexing (OFDM) signal modulated with known frequency domain symbols.

[0081] When frequency domain channel estimation is performed at the receiver, the received pilot sequence can be FFT'd into the frequency domain as can be done for the data blocks. Therefore, it may be helpful for the pilot chip sequence to have the same type of cyclic redundancy and the same length as a data block. If the pilot chip sequence length differs from the length of a data block, then a different size FFT may be required for the received pilot data, and the resulting frequency domain channel estimates can be either downsampled or upsampled (interpolated) when computing the channel responses at the frequency bins used on the data blocks.

[0082]FIG. 8 illustrates one embodiment of the invention as a flow diagram 800 of the steps the transmitter may perform to generate and transmit a data sequence on data block b. A long code or long sequence “c”, which is a sequence known at the receiver and the transmitter, is provided 810 the embodiment. The long sequence is broken up into smaller sequences, c[i, b], which may be different on each data block b. The length of c[i, b] is NK where N is the length of the spreading sequences W_(u)[n] (u=1 . . . U) and K is the number of sub-blocks (each sub-block is of length N) per data block, also called the sub-block index. The sub-block index can vary between 0 and K−1, and for the embodiment, k is initially set to equal zero 815.

[0083] On sub-block k of block b there are U active spreading sequences (out of N total) which can be provided to the transmitter 820. The U symbols for sub-block k of block b are d₁[k, b] through d_(U)[k. b]. The U symbol gains for sub-block k of block b are A₁ through A_(U). The factor A_(U) captures the power control gain factor for the u^(th) spreading code. Further, in the flow diagram 800 U spread symbols can be formed for sub-block k of block b by multiplying each symbol for sub-block k of block b by its respective spreading sequence and symbol gain 830. For one embodiment, the U spread symbols for sub-block k of block b, q_(u)[n, k, b] (n=0, . . . N−1, u=1 . . . U), are given as

q _(u) [n, k, b]=d _(u) [k, b]W _(u) [n].

[0084] Continuing, the spread waveform for sub-block k of block b may be formed by summing the U spread symbols for sub-block k of block b 840. The spread waveform for sub-block k of block b, z[n, k, b], can be illustrated as ${z\left\lbrack {n,k,b} \right\rbrack} = {\sum\limits_{u = 1}^{U}{{q_{u}\left\lbrack {n,k,b} \right\rbrack}.}}$

[0085] Next in flow diagram 800, the spread sequence for sub-block k of block b can be formed by multiplying the spread waveform for sub-block k of block b by the long code values for sub-block k of block b 850. The spread sequence for sub-block k on block b, a[n, k, b] can be illustrated as a[n, k, b]=z[n, k, b]c[kN+n, b]. Once completed, the sub-block index, k, can be incremented by one 860.

[0086] If the maximum number of sub-blocks is not reached 865, then one embodiment may continue forming the spread sequences for block b (repeat the flow diagram 800 from block 820). If the maximum number of sub-blocks is reached 865, the baseband chip-level sequence for block b may be formed by concatenating the K spread sequences for block b 870. The baseband chip-level sequence, s[i, b] (0≦i<NK−1) can be illustrated as the concatenation of the spread sequences for block b, s[i, b]={a[1, 1, b], . . . , a[N, 1, b], a[1, 2, b], . . . , a[N, 2, b], . . . , a[1, K, b], . . . , a[N, K, b]}. In an alternative embodiment, s[i, b] can be expressed as ${{s\left\lbrack {i,b} \right\rbrack} = {\sum\limits_{u = 1}^{U}{A_{u}{\sum\limits_{k = 0}^{K - 1}{{d_{u}\left\lbrack {k,b} \right\rbrack}{c\left\lbrack {i,b} \right\rbrack}{W_{u}\left\lbrack {i - {Nk}} \right\rbrack}}}}}},{0 \leq i \leq {{NK} - 1}},$

[0087] where it is understood that W_(u)[i] is nonzero only when 0≦i≦N−1.

[0088] The transmitted baseband chip sequence for block b, x[i, b], may be formed next 880 by adding the cyclic redundancy to the baseband chip-level sequence for block b. As described earlier, the cyclic redundancy can be a prefix, a postfix, a split prefix/postfix, a null cyclic prefix, a null cyclic postfix, a block of known chips repeated before and after the baseband chip-level sequence, or a block of known chips which is inserted either before or after each of a plurality of baseband chip-level sequences. In one embodiment, a cyclic prefix of length L_(p) is added so that the transmitted baseband sequence for block b can be equated as: ${x\left\lbrack {i,b} \right\rbrack} = \begin{Bmatrix} {{s\left\lbrack {{i + {NK} - L_{p}},b} \right\rbrack},} & {0 \leq i \leq {L_{p} - 1}} \\ {s\left\lbrack {{i - L_{p}},b} \right\rbrack} & {L_{cp} \leq i \leq {{NK} + L_{p} - 1}} \end{Bmatrix}$

[0089] In one embodiment, the transmitted data sequence for block b may be formed by modulating the transmitted baseband chip sequence for block b by the pulse shaping waveform. The transmitted data sequence for block b, x_(b)(t), may be illustrated as: ${x_{b}(t)} = {\sum\limits_{i = 0}^{{NK} + L_{p} - 1}{{x\left\lbrack {i,b} \right\rbrack}{p_{sr}\left( {t - {iT}_{c}} \right)}}}$

[0090] where p_(sr)(t) is the pulse shaping waveform (e.g., a waveform with the square-root raised cosine spectrum). The complete transmitted waveform for blocks b=1 through B, x(t), may be given as: ${x(t)} = {\sum\limits_{b = 0}^{B - 1}{x_{b}\left( {t - {bT}_{b}} \right)}}$

[0091] where T_(b) is the time duration of a block.

[0092]FIG. 9 is a flow diagram of an embodiment of a receiver detecting the transmitted data symbols on data block b 900. The embodiment 900 begins by being provided a frequency domain channel estimate on block b, a block sampling reference, and knowledge of spreading sequences 910. The frequency domain channel estimate, H[k], on a single subcarrier is an M×1 vector of channel gains between the transmitter and each of M receive elements at a particular subcarrier. The frequency domain channel estimate can be expressed as the DFT of the time-domain channel, h[m], where the time-domain channel is the chip-level sampling of the convolution of the pulse waveform with the true RF channel. In equation form this relationship can be expressed as: ${H\lbrack k\rbrack} = {\sum\limits_{m = 0}^{N_{F} - 1}{{h\lbrack m\rbrack}^{{- {j2\pi}}\quad {{mk}/N_{F}}}}}$

[0093] where N_(F) is the DFT length or size (in one embodiment N_(F)=NK). h[m] may include zero valued samples because the channel length is typically much less than N_(F). The received chip-spaced samples on block b, r[m, b] (0≦m≦NK−1), are the appropriate N_(F) samples from block b's portion of the received signal sampled at the chip rate 920. When the cyclic redundancy is a cyclic prefix, N_(F)=NK. When the cyclic redundancy is comprised of known chips (KC) (null cyclic prefix, for example), N_(F)=NK+L_(p) where L_(p) is the length of the cyclic redundancy. Ignoring noise, r[m, b] can be modeled as: ${r\left\lbrack {m,b} \right\rbrack} = {\sum\limits_{n = 0}^{L_{p} - 1}{{h\lbrack n\rbrack}{s\left\lbrack {{m - n},b} \right\rbrack}}}$

[0094] The frequency domain samples on block b are the DFT of the received chip-spaced samples on block b, illustrated as: ${R\lbrack k\rbrack} = {\sum\limits_{m = 0}^{N_{F} - 1}{{r\lbrack m\rbrack}^{{- {j2}}\quad \pi \quad {{mk}/N_{F}}}}}$

[0095] This further illustrates converting the received chip-spaced samples on block b into frequency domain samples on block b 930.

[0096] In the embodiment 900 of FIG. 9, the frequency domain equalization weights on block b may be calculated 940. The frequency domain MMSE equalization weights on block b, w[k, b] (0≦k≦N_(F)−1), can be expressed as: ${w\left\lbrack {k,b} \right\rbrack} = \frac{H\left\lbrack {k,b} \right\rbrack}{{{H^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}} + {\sigma^{2}(k)}}$

[0097] where σ²(k) is the frequency domain noise plus interference power on subcarrier k.

[0098] The process of embodiment continues by calculating the frequency domain signal estimate on block b as a function of the frequency domain equalization weights on block b and the frequency domain samples on block b 950. The frequency domain signal estimate on block b, Z[k, b], can be illustrated as:

Z[k, b]=w ^(H) [k, b]R[k, b]

[0099] Next 960, the frequency domain signal estimate on block b may be converted into a time-domain signal estimate on block b. In equation form, the time-domain signal estimate on block b, z[k, b] can be: ${z\left\lbrack {m,b} \right\rbrack} = {\frac{1}{N_{F}}{\sum\limits_{k = 0}^{N_{F} - 1}{{Z\left\lbrack {k,b} \right\rbrack}^{{- {j2\pi}}\quad {{mk}/N_{F}}}}}}$

[0100] Finally 970, at least one symbol from the time-domain signal estimate on block b may be despread when the time-domain signal is sent to a conventional single or multicode despreader. This can recover any subset of the U transmitted signals on each of the K sub-blocks in block b.

[0101] In one embodiment, the symbol estimate for the U^(th) Walsh channel can be expressed as the despreading of the signal estimate on block b as follows: ${{\hat{d}}_{u}\left\lbrack {k,b} \right\rbrack} = {\frac{1}{A_{u}}{\sum\limits_{m = 0}^{N - 1}{{W_{u}\lbrack m\rbrack}{c\left\lbrack {{m + {kN}},b} \right\rbrack}{z\left\lbrack {{m + {kN}},b} \right\rbrack}}}}$

[0102] Illustrated in FIG. 10 is a flow diagram of one embodiment 1000 of a transmitter in accordance with the invention. The embodiment 1000 may assume that the time varying long-code can be combined with the spreading sequence. The embodiment begins by setting the sub-block index k, equal to zero 1015. On sub-block k and block b there are U active spreading sequences (out of N total) which can be provided to the transmitter 1020. The U symbols for sub-block k of block b are d₁[k, b] through d_(U)[k. b]. The U symbol gains for sub-block k of block b are A₁ through A_(U). The factor A_(U) captures the power control gain factor for the u^(th) spreading code. Further in the embodiment 1000, U spread sequences can be formed for sub-block k of block b by multiplying each symbol for sub-block k of block b by its respective spreading sequence and symbol gain 1030.

[0103] The embodiment 1000 may increment the sub-block index k by one 1060. If the maximum number of sub-blocks is not reached 1065, then one embodiment may form U additional spread sequences (one for each of the U code channels) for block b (repeat the embodiment 1000 from block 1020). If the maximum number of sub-blocks is reached 1065, spread sequences having the same code channel may be concatenated into a spread sequence block. This step is done for each code channel to form U spread sequence blocks 1070.

[0104] A further embodiment 1000 may add cyclic redundancy to each individual spread sequence block to form U block sequences with cyclic redundancy 1080. The U block sequences with cyclic redundancy may be chip-level summed to form a multicode spread sequence block with cyclic redundancy 1090. Another embodiment 1000 may form a pulse-shaped signal on block b by applying a chip pulse shaping function to the multicode spread sequence block with cyclic redundancy 1095. The pulse-shaped signal may then be transmitted.

[0105] One embodiment of the invention has been described for the forward link of a direct-sequence spread spectrum system, but an embodiment of the invention can also be used for the reverse link, or uplink, of a direct-sequence spread spectrum or CDMA communication system. Further, an embodiment of the invention can be used in a point-to-point or point-to-multipoint direct-sequence spread spectrum communication link.

[0106] Additionally in an embodiment of the invention, Walsh codes can be used to define a plurality of code channels in the transmitted signal; however, alternative embodiments may also be used with other types of channelization and/or spreading codes. Generally, orthogonal codes should be used to obtain the highest performance. Additional embodiments of the invention can also be used in a system that uses variable spreading factors.

[0107] In one embodiment of the invention, the cyclic redundancy is inserted before the pulse shape filtering is applied; however, alternative embodiments may insert the cyclic redundancy after pulse shape filtering. In this case, the spread sequence portion and the cyclic redundancy are pulse shape filtered separately, and are then combined prior to transmission. Since the pulse shape filtering is a linear signal processing operation, the combining may be performed such that the transmitted sequence or signal is mathematically the same as for the embodiments where the cyclic redundancy is inserted before the pulse shape filtering is applied.

[0108] In one embodiment of the invention, a frequency domain equalizer is used in the receiver, and the equalized signal is despread following the frequency domain equalizer. In an alternate embodiment, the frequency domain equalizer may be followed by additional processing to further enhance the equalized signal. For such an embodiment, a feedback filter that cancels post-cursor inter-chip interference may be used after the frequency domain equalized signal is transformed to the time domain. In this embodiment, all transmitted code channels should be despread and detected. The detected symbols, code channel gains, spreading codes from the code channels, and the long code are then used to synthesize an estimate of the multi-code chip-level sequence that was transmitted. The synthesized chip-level sequence is fed into the feedback filter. In this alternate embodiment, the values of the frequency domain equalization weights may be different than in previously described embodiments. The frequency domain equalization weights and the feedback filter weights may be jointly computed according to a minimum mean square error or zero forcing criterion, for example. This alternate embodiment may not be applicable if the receiver cannot determine one or more of the following: The number of code channels that are being transmitted (the number of active code channels), the specific channelization codes that are being used, the code channel gain of each channelization code. Furthermore, the performance of this alternate embodiment is sensitive to any errors in the detected symbols on any active code channel.

[0109] In an additional alternate embodiment, the frequency domain equalization methods of the invention can be used when the spread sequence does not include cyclic redundancy. In this embodiment, the receiver complexity is typically greater than other embodiments because additional processing steps, such as overlap-and-add or overlap-and-save filtering techniques need to be used.

[0110] The embodiments of the present invention may be implemented in hardware, software, or combinations of hardware and software. The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes that come within the meaning and range of equivalency of the claims are to be embraced within their scope. 

We claim:
 1. A method comprising: providing at least one spread sequence portion; providing a cyclic redundancy; and forming a transmitted sequence based on the spread sequence portion and the cyclic redundancy.
 2. The method of claim 1, wherein the spread sequence portion is a fraction of a spread sequence.
 3. The method of claim 1, wherein the spread sequence portion is at least one spread sequence.
 4. The method of claim 1, wherein the spread sequence portion comprises a plurality of concatenated spread sequences.
 5. The method of claim 1, wherein the spread sequence portion comprises a baseband chip-level sequence.
 6. The method of claim 5, wherein the baseband chip-level sequence is computed according to: ${{s\left\lbrack {i,b} \right\rbrack} = {\sum\limits_{u = 1}^{U}{A_{u}{\sum\limits_{k = 0}^{K - 1}{{d_{u}\left\lbrack {k,b} \right\rbrack}{c\left\lbrack {i,b} \right\rbrack}{W_{u}\left\lbrack {i - {Nk}} \right\rbrack}}}}}},\quad {0 \leq i \leq {{NK} - 1.}}$


7. The method of claim 1, wherein the spread sequence portion comprises a multicode sequence.
 8. The method of claim 1, wherein the forming comprises inserting cyclic redundancy to the spread sequence portion for at least one symbol boundary.
 9. The method of claim 1, wherein the cyclic redundancy comprises zero value chips.
 10. The method of claim 1, wherein the cyclic redundancy comprises a known sequence.
 11. The method of claim 1, wherein the transmitted sequence is formed according to: ${x\left\lbrack {i,b} \right\rbrack} = \left\{ {\begin{matrix} {\quad {{s\left\lbrack {i,b} \right\rbrack},}} & {\quad {0 \leq i \leq {{NK} - 1}}} \\ {\quad {{s\left\lbrack {{i - {NK}},b} \right\rbrack},}} & {\quad {{NK} \leq i \leq {{NK} + L_{p} - 1}}} \end{matrix}.} \right.$


12. The method of claim 1, wherein the transmitted sequence is formed according to: ${x\left\lbrack {i,b} \right\rbrack} = \left\{ {\begin{matrix} {{s\left\lbrack {{i + {N\quad K} - L_{p}},b} \right\rbrack},} & {0 \leq i \leq {L_{p} - 1}} \\ {{s\left\lbrack {{i - L_{p}},b} \right\rbrack},} & {L_{p} \leq i \leq {{N\quad K} + L_{p} - 1}} \end{matrix}.} \right.$


13. The method of claim 1, wherein the forming of the transmitted sequence comprises inserting the cyclic redundancy as a cyclic prefix to at least one spread sequence portion and as a cyclic postfix to at least one spread sequence portion.
 14. A communication apparatus comprising a transmitting device to form a transmitted sequence based on a spread sequence and a cyclic redundancy.
 15. The communication apparatus of claim 14, wherein the spread sequence portion is a fraction of a spread sequence.
 16. The communication apparatus of claim 14, wherein the spread sequence portion is at least one spread sequence.
 17. The communication apparatus of claim 14, wherein the spread sequence portion comprises a plurality of concatenated spread sequences.
 18. The communication apparatus of claim 14, wherein the at least one spread sequence portion comprises a baseband chip-level sequence.
 19. The communication apparatus of claim 18, wherein the baseband chip-level sequence is computed according to: ${{s\left\lbrack {i,b} \right\rbrack} = {\sum\limits_{u = 1}^{U}{A_{u}{\sum\limits_{k = 0}^{K - 1}{{d_{u}\left\lbrack {k,b} \right\rbrack}{c\left\lbrack {i,b} \right\rbrack}{W_{u}\left\lbrack {i - {N\quad k}} \right\rbrack}}}}}},{0 \leq i \leq {{N\quad K} - 1.}}$


20. The communication apparatus of claim 14, wherein the spread sequence portion comprises a multicode sequence.
 21. The communication apparatus of claim 14, wherein the forming of the transmitted sequence comprises inserting cyclic redundancy to the spread sequence for at least one symbol boundary.
 22. The communication apparatus of claim 14, wherein the cyclic redundancy comprises zero value chips.
 23. The communication apparatus of claim 14, wherein the cyclic redundancy comprises a known sequence.
 24. The communication apparatus of claim 14, wherein the transmitted sequence is formed according to: ${x\left\lbrack {i,b} \right\rbrack} = \left\{ {\begin{matrix} {{s\left\lbrack {i,b} \right\rbrack},} & {0 \leq i \leq {{N\quad K} - 1}} \\ {{s\left\lbrack {{i - {N\quad K}},b} \right\rbrack},} & {{N\quad K} \leq i \leq {{N\quad K} + L_{p} - 1}} \end{matrix}.} \right.$


25. The communication apparatus of claim 14, wherein the transmitted sequence is formed according to: ${x\left\lbrack {i,b} \right\rbrack} = \left\{ {\begin{matrix} {{s\left\lbrack {{i + {N\quad K} - L_{p}},b} \right\rbrack},} & {0 \leq i \leq {L_{p} - 1}} \\ {{s\left\lbrack {{i - L_{p}},b} \right\rbrack},} & {L_{p} \leq i \leq {{N\quad K} + L_{p} - 1}} \end{matrix}.} \right.$


26. The communication apparatus of claim 14, wherein the forming of the transmitted sequence comprises inserting the cyclic redundancy as a cyclic prefix to at least one spread sequence portion and as a cyclic postfix to at least one spread sequence portion.
 27. A communication system comprising: means for providing at least one spread sequence portion; and means for inserting a cyclic redundancy to the spread sequence portion to form a transmitted sequence.
 28. The communication system of claim 27, further comprising means for creating a cyclic redundancy.
 29. A computer readable medium storing a computer program comprising computer readable code for forming a sequence based on a cyclic redundancy and at least one spread sequence portion.
 30. The computer readable medium of claim 29, wherein the spread sequence portion is a fraction of a spread sequence.
 31. The computer readable medium of claim 29, wherein the spread sequence portion is at least one spread sequence.
 32. The computer readable medium of claim 29, wherein the spread sequence portion comprises a plurality of concatenated spread sequences.
 33. The computer readable medium of claim 29, wherein the at least one spread sequence portion comprises a baseband chip-level sequence.
 34. The computer readable medium of claim 29, wherein the baseband chip-level sequence is computed according to: ${{s\left\lbrack {i,b} \right\rbrack} = {\sum\limits_{u = 1}^{U}{A_{u}{\sum\limits_{k = 0}^{K - 1}{{d_{u}\left\lbrack {k,b} \right\rbrack}{c\left\lbrack {i,b} \right\rbrack}{W_{u}\left\lbrack {i - {N\quad k}} \right\rbrack}}}}}},{0 \leq i \leq {{N\quad K} - 1.}}$


35. The computer readable medium of claim 29, wherein the spread sequence portion comprises a multicode sequence.
 36. The computer readable medium of claim 29, wherein the forming comprises inserting cyclic redundancy to the spread sequence portion for at least one symbol boundary.
 37. The computer readable medium of claim 29, wherein the cyclic redundancy comprises zero value chips.
 38. The computer readable medium of claim 29, wherein the cyclic redundancy comprises a known sequence.
 39. The computer readable medium of claim 29, wherein the sequence is formed according to: ${x\left\lbrack {i,b} \right\rbrack} = \left\{ {\begin{matrix} {{s\left\lbrack {i,b} \right\rbrack},} & {0 \leq i \leq {{N\quad K} - 1}} \\ {{s\left\lbrack {{i - {N\quad K}},b} \right\rbrack},} & {{N\quad K} \leq i \leq {{N\quad K} + L_{p} - 1}} \end{matrix}.} \right.$


40. The computer readable medium of claim 29, wherein the sequence is formed according to: ${x\left\lbrack {i,b} \right\rbrack} = \left\{ {\begin{matrix} {{s\left\lbrack {{i + {N\quad K} - L_{p}},b} \right\rbrack},} & {0 \leq i \leq {L_{p} - 1}} \\ {{s\left\lbrack {{i - L_{p}},b} \right\rbrack},} & {L_{p} \leq i \leq {{N\quad K} + L_{p} - 1}} \end{matrix}.} \right.$


41. The computer readable medium of claim 29, wherein the forming of the sequence comprises inserting the cyclic redundancy as a cyclic prefix to at least one spread sequence portion and as a cyclic postfix to at least one spread sequence portion.
 42. A method of operating a communication apparatus, comprising: converting a plurality of receive samples from at least one spread sequence portion into a plurality of frequency domain samples; and determining an equalized signal based on the frequency domain samples.
 43. The method of claim 42, further comprising: determining a plurality of frequency domain equalization weights for the frequency domain samples; and determining a time domain signal estimate based on the frequency domain equalization weights and frequency domain samples.
 44. The method of claim 42, wherein the receive samples include cyclic redundancy.
 45. The method of claim 44, wherein the receive samples including cyclic redundancy are converted into the plurality of frequency domain samples.
 46. The method of claim 42, further comprising: receiving the receive samples at a plurality of receiver branches.
 47. The method of claim 42, wherein the receive samples comprise chip-spaced samples.
 48. The method of claim 42, wherein the frequency domain equalization weights are determined based on a power weight, a plurality of frequency domain channel estimates, and one of at least one noise power, at least one interference power, and at least one noise plus interference power.
 49. The method of claim 43, wherein the frequency domain equalization rates are determined according to: ${w\left\lbrack {k,b} \right\rbrack} = {\left( {{\sum\limits_{j = 1}^{J}{{H_{j}\left\lbrack {k,b} \right\rbrack}{H_{j}^{H}\left\lbrack {k,b} \right\rbrack}}} + {\sigma^{2}I}} \right)^{- 1}{{H_{1}\left\lbrack {k,b} \right\rbrack}.}}$


50. The method of claim 43, wherein the frequency domain equalization rates are determined according to: w[k, b]={Θ[k, b](Θ^(H) [k, b]Θ[k, b])⁻¹}₁.
 51. The method of claim 43, wherein the frequency domain equalization weights are determined according to: ${w\left\lbrack {k,b} \right\rbrack} = {\frac{\sqrt{\alpha}{H\left\lbrack {k,b} \right\rbrack}}{{\alpha \quad {H^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}} + {\sigma^{2}(k)}}.}$


52. The method of claim 43, wherein the frequency domain equalization weights are scaled according to: $\beta = {\frac{1}{\frac{1}{N\quad K}{\sum\limits_{k = 0}^{{N\quad K} - 1}{{w^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}}}}.}$


53. The method of claim 42, further comprising: removing a cyclic redundancy from the receive samples prior to converting to the frequency domain samples.
 54. The method of claim 43, wherein the frequency domain equalization weights are determined according to: ${w\left\lbrack {k,b} \right\rbrack} = {\frac{H\left\lbrack {k,b} \right\rbrack}{{{H^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}} + \frac{\sigma^{2}(k)}{\alpha}}.}$


55. A communication apparatus comprising: means for converting a plurality of receive samples from at least one spread sequence portion into a plurality of frequency domain samples; and means for determining an equalized signal based on the frequency domain samples.
 56. The communication apparatus of claim 55, further comprising: means for determining a plurality of frequency domain equalization weights for the frequency domain samples; and means for determining a time domain signal estimate based on the frequency domain equalization weights and frequency domain samples.
 57. A communication apparatus comprising a receiving device to convert a plurality of receive samples from at least one spread sequence portion into a plurality of frequency domain samples, to determine an equalized signal based on the frequency domain samples.
 58. The communication apparatus of claim 57, wherein the receiving device determines a plurality of frequency domain equalization weights for the frequency domain samples, and determines a time domain signal estimate based on the frequency domain equalization weights and frequency domain samples.
 59. The communication apparatus of claim 57, wherein the receive samples include cyclic redundancy.
 60. The communication apparatus of claim 59, wherein the receive samples including cyclic redundancy are converted into the plurality of frequency domain samples.
 61. The communication apparatus of claim 57, wherein the receiver device comprises a plurality of receiver branches to receive the receive samples.
 62. The communication apparatus of claim 57, wherein the receive samples comprise chip-spaced samples.
 63. The communication apparatus of claim 58, wherein the receiver device determines the frequency domain equalization weights based on a power weight, a plurality of frequency domain channel estimates, and one of at least one noise power, at least one interference power, and at least one noise plus interference power.
 64. The communication apparatus of claim 58, wherein the frequency domain equalization rates are determined according to: ${w\left\lbrack {k,b} \right\rbrack} = {\left( {{\sum\limits_{j = 1}^{J}\quad {{H_{j}\left\lbrack {k,b} \right\rbrack}{H_{j}^{H}\left\lbrack {k,b} \right\rbrack}}} + {\sigma^{2}I}} \right)^{- 1}{{H_{1}\left\lbrack {k,b} \right\rbrack}.}}$


65. The communication apparatus of claim 58, wherein the frequency domain equalization rates are determined according to: w[k, b]={Θ[k, b](Θ^(H) [k, b]Θ[k, b])⁻¹}₁.
 66. The communication apparatus of claim 58, wherein the frequency domain equalization weights are determined according to: ${w\left\lbrack {k,b} \right\rbrack} = {\frac{\sqrt{\alpha}{H\left\lbrack {k,b} \right\rbrack}}{{\alpha \quad {H^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}} + {\sigma^{2}(k)}}.}$


67. The communication apparatus of claim 58, wherein the frequency domain equalization weights are scaled according to: $\beta = {\frac{1}{\frac{1}{NK}{\sum\limits_{k = 0}^{{NK} - 1}\quad {{w^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}}}}.}$


68. The communication apparatus of claim 57, wherein the receiving device removes a cyclic redundancy from the receive samples prior to converting to the frequency domain samples.
 69. The communication apparatus of claim 58, wherein the frequency domain equalization weights are determined according to: ${w\left\lbrack {k,b} \right\rbrack} = {\frac{H\left\lbrack {k,b} \right\rbrack}{{{H^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}} + \frac{\sigma^{2}(k)}{\alpha}}.}$


70. A computer readable medium including a program comprising: computer readable code for converting a plurality of receive samples from at least one spread sequence portion into a plurality of frequency domain samples; and computer readable code for determining an equalized signal based on the frequency domain samples.
 71. The computer readable medium of claim 70, further comprising: computer readable code for determining a plurality of frequency domain equalization weights for the frequency domain samples; and computer readable code for determining a time domain signal estimate based on the frequency domain equalization weights and frequency domain samples.
 72. The computer readable medium of claim 70, wherein the receive samples include cyclic redundancy.
 73. The computer readable medium of claim 72, wherein the receive samples including cyclic redundancy are converted into the plurality of frequency domain samples.
 74. The computer readable medium of claim 70, further comprising: receiving the receive samples at a plurality of receiver branches.
 75. The computer readable medium of claim 70, wherein the receive samples comprise chip-spaced samples.
 76. The computer readable medium of claim 71, wherein the frequency domain equalization weights are determined based on a power weight, a plurality of frequency domain channel estimates, and one of at least one noise power, at least one interference power, and at least one noise plus interference power.
 77. The computer readable medium of claim 71, wherein the frequency domain equalization rates are determined according to: ${w\left\lbrack {k,b} \right\rbrack} = {\left( {{\sum\limits_{j = 1}^{J}\quad {{H_{j}\left\lbrack {k,b} \right\rbrack}{H_{j}^{H}\left\lbrack {k,b} \right\rbrack}}} + {\sigma^{2}I}} \right)^{- 1}{{H_{1}\left\lbrack {k,b} \right\rbrack}.}}$


78. The computer readable medium of claim 71, wherein the frequency domain equalization rates are determined according to: w[k, b]={Θ[k, b](Θ^(H) [k, b]Θ[k, b])⁻¹}₁.
 79. The computer readable medium of claim 71, wherein the frequency domain equalization weights are determined according to: ${w\left\lbrack {k,b} \right\rbrack} = {\frac{\sqrt{\alpha}{H\left\lbrack {k,b} \right\rbrack}}{{\alpha \quad {H^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}} + {\sigma^{2}(k)}}.}$


80. The computer readable medium of claim 71, wherein the frequency domain equalization weights are scaled according to: $\beta = {\frac{1}{\frac{1}{NK}{\sum\limits_{k = 0}^{{NK} - 1}\quad {{w^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}}}}.}$


81. The computer readable medium of claim 70, further comprising: removing a cyclic redundancy from the receive samples prior to converting to the frequency domain samples.
 82. The computer readable medium of claim 71, wherein the frequency domain equalization weights are determined according to: ${w\left\lbrack {k,b} \right\rbrack} = {\frac{H\left\lbrack {k,b} \right\rbrack}{{{H^{H}\left\lbrack {k,b} \right\rbrack}{H\left\lbrack {k,b} \right\rbrack}} + \frac{\sigma^{2}(k)}{\alpha}}.}$


83. A communication apparatus for using a communication signal format, said format comprising: at least one chip-level sequence, and at least one chip-level cyclic redundancy sequence, concatenated with the at least one chip-level sequence.
 84. The apparatus of claim 83 wherein the chip-level sequence is a multicode chip-level sequence. 